Communication Adaptive Self-Stabilizing Group Membership Service
نویسندگان
چکیده
This paper presents the first (randomized) algorithm for implementing self-stabilizing group communication services in an asynchronous system. Our algorithm converges rapidly to legal behavior and is communication adaptive, namely, the communication volume is high when the system recovers from the occurrence of faults and is low once a legal state is reached. Communication adaptability is achieved by a new technique that combines transient fault detectors.
منابع مشابه
Self-stabilizing Virtual Synchrony
Virtual synchrony (VS) is an important abstraction that is proven to be extremely useful when implemented over asynchronous, typically large, message-passing distributed systems. Fault tolerant design is critical for the success of such implementations since large distributed systems can be highly available as long as they do not depend on the full operational status of every system participant...
متن کامل2 00 8 Best - effort Group Service in Dynamic Networks ∗
We propose a group membership service for asynchronous wireless dynamic ad hoc networks. It maintains as long as possible the existing groups and ensures that the groups’ diameters are always smaller than a constant, fixed according to applications requirements. The proposed protocol is self-stabilizing in a dynamic distributed system. Moreover, it ensures a continuity property, meaning that, w...
متن کاملToward a Solution to Partitionable Group Membership for MANETs
Ubiquitous computing environments are characterised by a diversity of mobile nodes and networks, and in particular, mobile ad-hoc networks. Mobile Ad-hoc NETworks (MANETs) are self-organising networks that lack a fixed infrastructure, and due to nodes arrivals, departures, crashes and movements, they are very dynamic networks. The topology changes occur both rapidly and unexpectedly and nodes (...
متن کاملAn Efficient Topology-Adaptive Membership Protocol for Large-Scale Network Services
A highly available large-scale service cluster often requires the system to discover new nodes and identify failed nodes quickly in order to handle a high volume of traffic. Determining node membership efficiently in such an environment is critical to location-transparent service invocation, load balancing and failure shielding. In this paper, we present a topology-aware hierarchical membership...
متن کاملSCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
Gossip-based protocols have received considerable attention for broadcast applications due to their attractive scalability and reliability properties. The reliability of probabilistic gossip schemes studied so far depends on each user having knowledge of the global membership and choosing gossip targets uniformly at random. The requirement of global knowledge is undesirable in largescale distri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Parallel Distrib. Syst.
دوره 14 شماره
صفحات -
تاریخ انتشار 2001